Theory of computation

Results: 2087



#Item
381

1995 Paper 3 Question 9 Computation Theory Give a brief explanation of each of the following: (a) the encoding of register machine programs as numbers

Add to Reading List

Source URL: www.cl.cam.ac.uk

- Date: 2014-06-09 10:17:03
    382

    2010 Paper 6 Question 3 Computation Theory (a) Define the notion of a register machine and the computation it carries out. [5 marks] (b) What does it mean for a partial function f (x1 , . . . , xn ) of n arguments to be

    Add to Reading List

    Source URL: www.cl.cam.ac.uk

    Language: English - Date: 2014-06-09 10:18:37
      383

      2010 Paper 6 Question 4 Computation Theory (a) Define Church’s representation of numbers n as λ-terms n. [3 marks]

      Add to Reading List

      Source URL: www.cl.cam.ac.uk

      - Date: 2014-06-09 10:18:37
        384

        2000 Paper 4 Question 8 Computation Theory Let N be the natural numbers {0, 1, 2 . . .}. What is meant by each of the following statements? • The subset S ⊆ N is recursive.

        Add to Reading List

        Source URL: www.cl.cam.ac.uk

        - Date: 2014-06-09 10:17:35
          385

          1997 Paper 4 Question 8 Computation Theory Define what is meant by saying that a set of partial recursive (µR) functions is recursively enumerable. Explain briefly how the universal register machine might be used to de

          Add to Reading List

          Source URL: www.cl.cam.ac.uk

          - Date: 2014-06-09 10:17:16
            386

            1999 Paper 3 Question 9 Computation Theory Define computation by a register machine, explaining the action of the program. [4 marks] What is meant by the current configuration during a register machine computation?

            Add to Reading List

            Source URL: www.cl.cam.ac.uk

            - Date: 2014-06-09 10:17:27
              387

              2003 Paper 3 Question 7 Computation Theory What is meant by a register machine? Explain the action of a register machine program. [6 marks]

              Add to Reading List

              Source URL: www.cl.cam.ac.uk

              - Date: 2014-06-09 10:17:52
                388

                1997 Paper 3 Question 9 Computation Theory Explain the action of a Turing machine, and show how the progress of a computation may be tracked by maintaining a record of the configuration at each time t. Prove that a comp

                Add to Reading List

                Source URL: www.cl.cam.ac.uk

                Language: English - Date: 2014-06-09 10:17:15
                  389

                  Exploit Programming From Buffer Overflows to “Weird Machines” and Theory of Computation Se r g e y B r a t u s , M i c h a e l E . L o c a s t o , M e r e d i t h L . P a t t e r s o n , Le n S a s s a m a n , a n d

                  Add to Reading List

                  Source URL: www.usenix.org

                  Language: English
                    390

                    1998 Paper 4 Question 8 Computation Theory Explain Church’s Thesis, making clear its connection with computability. [3 marks] Define precisely what is meant by the set of all Primitive Recursive (PR) functions.

                    Add to Reading List

                    Source URL: www.cl.cam.ac.uk

                    - Date: 2014-06-09 10:17:22
                      UPDATE